Discretization Based on Entropy and Multiple Scanning
نویسندگان
چکیده
منابع مشابه
Discretization Based on Entropy and Multiple Scanning
In this paper we present entropy driven methodology for discretization. Recently, the original entropy based discretization was enhanced by including two options of selecting the best numerical attribute. In one option, Dominant Attribute, an attribute with the smallest conditional entropy of the concept given the attribute is selected for discretization and then the best cut point is determine...
متن کاملEvolutionary Optimization Guided by Entropy-Based Discretization
The Learnable Evolution Model (LEM) involves alternating periods of optimization and learning, performa extremely well on a range of problems, a specialises in achieveing good results in relatively few function evaluations. LEM implementations tend to use sophisticated learning strategies. Here we continue an exploration of alternative and simpler learning strategies, and try Entropy-based Disc...
متن کاملA Comparison of Four Approaches to Discretization Based on Entropy
We compare four discretization methods, all based on entropy: the original C4.5 approach to discretization, two globalized methods, known as equal interval width and equal frequency per interval, and a relatively new method for discretization called multiple scanning using the C4.5 decision tree generation system. The main objective of our research is to compare the quality of these four method...
متن کاملConstructing neural networks for multiclass-discretization based on information entropy
Cios and Liu (1992) proposed an entropy-based method to generate the architecture of neural networks for supervised two-class discretization. For multiclass discretization, the inter-relationship among classes is reduced to a set of binary relationships, and an independent two-class subnetwork is created for each binary relationship. This two-class-based method ends up with the disability of sh...
متن کاملError-Based and Entropy-Based Discretization of Continuous Features
We present a comparison of error-based and entropybased methods for discretization of continuous features. Our study includes both an extensive empirical comparison as well as an analysis of scenarios where error minimization may be an inappropriate discretization criterion. We present a discretization method based on the C4.5 decision tree algorithm and compare it to an existing entropy-based ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2013
ISSN: 1099-4300
DOI: 10.3390/e15051486